Eliminating internal behaviour in Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 411-425, issn 0302-9743, isbn 3-540-22236-7, 15 p.Conference Paper

The corali project: From conceptual graphs to conceptual graphs via labelled graphsCHEIN, M.Lecture notes in computer science. 1997, pp 65-79, issn 0302-9743, isbn 3-540-63308-1Conference Paper

On the impossibility of a generalization of the HOMFLY : Polynomial to labelled oriented graphsCHRISTENSEN, A; ROSEBROCK, S.Annales de la faculté des sciences de Toulouse. 1996, Vol 5, Num 3, pp 407-419, issn 0240-2963Article

Structure of the reachability problem for (0,1)-capacitated marked graphsTHULASIRAMAN, K; COMEAU, M. A.IEEE transactions on circuits and systems. 1987, Vol 34, Num 3, pp 317-319, issn 0098-4094Article

Relabelling in graph transformationHABEL, Annegret; PLUMP, Detlef.Lecture notes in computer science. 2002, pp 135-147, issn 0302-9743, isbn 3-540-44310-X, 13 p.Conference Paper

ABSTRAHOWANIE DLA ROZSZERZONYCH GRAFOW MARKOWANYCH = ABSTRACTION POUR DES GRAPHES MARQUES ETENDUSMAGOTT J.1982; PODSTAWY STEROWANIA; ISSN 0374-4094; POL; DA. 1982; VOL. 12; NO 3-4; PP. 97-116; ABS. ENG/RUS; BIBL. 11 REF.Article

COUNTING COLOURED GRAPHS OF HIGH CONNECTIVITYBOLLOBAS B.1981; CAN. J. MATH.; ISSN 0008-414X; CAN; DA. 1981; VOL. 33; NO 2; PP. 476-484; BIBL. 13 REF.Article

ADDITIONAL METHODS FOR REDUCTION AND EXPANSION OF MARKED GRAPHSJOHNSONBAUGH R; MURATA T.1981; IEEE TRANS. CIRCUITS SYST.; ISSN 0098-4094; USA; DA. 1981; VOL. 28; NO 10; PP. 1009-1014; BIBL. 14 REF.Article

ANALYSIS OF MARKED GRAPHS WITH SAFE CONDITIONTAGUCHI T; KODAMA S; KUMAGAI S et al.1980; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1980 PUBL. 1982; VOL. 11; NO 2; PP. 81-88; BIBL. 7 REF.Article

On the minimum label spanning tree problemKRUWKE, S. O; WIRTH, H.-C.Information processing letters. 1998, Vol 66, Num 2, pp 81-85, issn 0020-0190Article

Upper and lower bounds for stochastic marked graphsRAJSBAUM, S.Information processing letters. 1994, Vol 49, Num 6, pp 291-295, issn 0020-0190Article

Polyèdres avec un nombre fini de types de sommets = Polyhedra with a finite set of types of verticesBENAKLI, N.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 317, Num 9, pp 863-866, issn 0764-4442Article

Mahonian statistics on labeled forestsLIANG, K; WACHS, M. L.Discrete mathematics. 1992, Vol 99, Num 1-3, pp 181-197, issn 0012-365XArticle

Planar separatorsALON, N; SEYMOUR, P; THOMAS, R et al.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 184-193, issn 0895-4801Article

Cycles through specified verticesBOLLOBAS, B; BRIGHTWELL, G.Combinatorica (Print). 1993, Vol 13, Num 2, pp 147-155, issn 0209-9683Article

On the number of labeled acyclic digraphsRODIONOV, V. I.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 319-321, issn 0012-365XArticle

Circular permutation graph family with applications : Discrete algorithms and complexityLOU, R. D; SARRAFZADEH, M.Discrete applied mathematics. 1992, Vol 40, Num 3, pp 433-457, issn 0166-218XArticle

Asymptotic enumeration by degree sequence of graphs with degrees o(n^1/2)MCKAY, B. D; WORMALD, N. C.Combinatorica (Print). 1991, Vol 11, Num 4, pp 369-382, issn 0209-9683Article

Using composite low rank and sparse graph for label propagationJUNJUN GUO; DAIWEN WU.Electronics letters. 2014, Vol 50, Num 2, pp 84-86, issn 0013-5194, 3 p.Article

On the clique-width of graphs in hereditary classesBOLIAC, Rodica; LOZIN, Vadim.Lecture notes in computer science. 2002, pp 44-54, issn 0302-9743, isbn 3-540-00142-5, 11 p.Conference Paper

Labelling recursive auto-associative memorySPERDUTI, A.Connection science (Print). 1994, Vol 6, Num 4, pp 429-459, issn 0954-0091Article

Orientation embedding of signed graphsZASLAVSKY, T.Journal of graph theory. 1992, Vol 16, Num 5, pp 399-422, issn 0364-9024Article

Enumeration of difference graphsPELED, U. N; SUN, F.Discrete applied mathematics. 1995, Vol 60, Num 1-3, pp 311-318, issn 0166-218XArticle

Page / 13